Logic in computer science

Results: 2713



#Item
991On the Complexity of Deciding Sense of Direction∗ Paolo Boldi† Sebastiano Vigna†  Abstract

On the Complexity of Deciding Sense of Direction∗ Paolo Boldi† Sebastiano Vigna† Abstract

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2002-05-18 04:50:05
9921 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh

1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2012-04-27 14:06:25
993Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning Menkes van den Briel Subbarao Kambhampati

Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning Menkes van den Briel Subbarao Kambhampati

Add to Reading List

Source URL: www.menkes76.com

Language: English - Date: 2012-10-29 18:19:38
994Automated theorem proving / NP-complete problems / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Resolution / Unit propagation / Constraint satisfaction / Theoretical computer science / Mathematics / Applied mathematics

The Phase Transition in Exact Cover Vamsi Kalapala∗ and Cristopher Moore∗,† {vamsi,moore}@cs.unm.edu, ∗ Department of Computer Science, University of New Mexico

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2008-10-23 11:39:06
995Lessons In Electric Circuits -- Volume IV Chapter 9 COMBINATIONAL LOGIC FUNCTIONS • • •

Lessons In Electric Circuits -- Volume IV Chapter 9 COMBINATIONAL LOGIC FUNCTIONS • • •

Add to Reading List

Source URL: www.saylor.org

Language: English - Date: 2013-03-20 16:11:32
996A Formalization of Programs in First-Order Logic with a Discrete Linear Order∗ Fangzhen Lin () Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, H

A Formalization of Programs in First-Order Logic with a Discrete Linear Order∗ Fangzhen Lin () Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, H

Add to Reading List

Source URL: www.cs.ust.hk

Language: English - Date: 2014-03-07 00:56:20
997

PDF Document

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2014-08-27 06:04:04
998Specification and Verification of Event Detectors and Responses Cynthia Disenfeld Shmuel Katz  Department of Computer Science

Specification and Verification of Event Detectors and Responses Cynthia Disenfeld Shmuel Katz Department of Computer Science

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-10-28 08:11:48
999Abstract Model Counting: a novel approach for Quantification of Information Leaks Quoc-Sang Phan Pasquale Malacaria

Abstract Model Counting: a novel approach for Quantification of Information Leaks Quoc-Sang Phan Pasquale Malacaria

Add to Reading List

Source URL: www.eecs.qmul.ac.uk

Language: English - Date: 2015-04-10 18:09:41
1000ZU064-05-FPR  rhiger-submitted 18 August 2008

ZU064-05-FPR rhiger-submitted 18 August 2008

Add to Reading List

Source URL: www.itu.dk

Language: English - Date: 2008-10-17 11:56:59